- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Works by Buss, Samuel (exact spelling)
Order:
- Neil Immerman. Upper and lower bounds for first order expressibility. Journal of computer and system sciences, vol. 25 , pp. 76–98. - Neil Immerman. Relational queries computable in polynomial time. Information and control, vol. 68 , pp. 86–104. - Neil Immerman. Languages that capture complexity classes. SIAM journal on computing, vol. 16 , pp. 760–778. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
- Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-55b469568f-bzrbm uwo